On Monodromy Matrix Computation
نویسندگان
چکیده
We present a study on the critical time step for the numerical integration based on the Runge-Kutta method of the monodromy matrix (the fundamental matrix solution) associated with a set of n rst-order linear ordinary diierential equations with periodic coeecients. By applying the Liapunov-Schmidt method, for any dimension n and systems which are perturbations of autonomous systems, we give an approximation to the critical time step which involves the autonomous part as well as the periodic perturbation.
منابع مشابه
F eb 1 99 4 Monodromy Map and Classical r - matrices
We compute the Poisson bracket relations for the monodromy matrix of the auxiliary linear problem. If the basic Poisson brackets of the model contain derivatives, this computation leads to a peculiar kind of symmetry breaking which accounts for a 'spontaneous quantiza-tion' of the underlying global gauge group. A classification of possible patterns of symmetry breaking is outlined.
متن کاملBoundary Conditions for Numerical Stability Analysis of Periodic Solutions of Ordinary Differential Equations
This paper considers numerical methods for stability analyses of periodic solutions of ordinary differential equations. Stability of a periodic solution can be determined by the corresponding monodromy matrix and its eigenvalues. Some commonly used numerical methods can produce inaccurate results of them in some cases, for example, near bifurcation points or when one of the eigenvalues is very ...
متن کاملCOMPUTING THE BRAID MONODROMY OF COMPLETELY REDUCIBLE n-GONAL CURVES
Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the rectangular braid diagram (RBD) method is proposed to compute the braid monodromy of a completely reducible n-gonal curve, i.e. the curves in the form (y−y1(x))...(y−yn(x)) = 0 where n ∈ Z+ and yi ∈ C[x]. Also, an algorithm is presented to compute the Alexander polynomial of these curve comp...
متن کاملA Newton - Picard
Periodic solutions of certain large scale systems of ODEs can be computed eeciently using a hybrid Newton-Picard scheme, especially in a continuation context. In this paper we describe and analyse a numerical method to accurately compute period doubling bifurcation points using the Newton-Picard approach. The method avoids the computation of the full monodromy matrix, which is present in the de...
متن کاملThe monodromy in the Hamiltonian Hopf bifurcation
A simple, straightforward computation is given of the monodromy near an equilibrium point of a Hamiltonian system with two degrees of freedom, which is close to a nondiagonalizable resonance.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007